On chirality of toroidal embeddings of polyhedral graphs
نویسندگان
چکیده
منابع مشابه
On Chirality of Toroidal Embeddings of Polyhedral Graphs
We investigate properties of spatial graphs on the standard torus. It is known that nontrivial embeddings of planar graphs in the torus contain a nontrivial knot or a nonsplit link due to [1],[2]. Building on this and using the chirality of torus knots and links [3],[4], we prove that nontrivial embeddings of simple 3connected planar graphs in the standard torus are chiral. For the case that th...
متن کاملOn Polyhedral Embeddings of Cubic Graphs
Polyhedral embeddings of cubic graphs by means of certain operations are studied. It is proved that some known families of snarks have no (orientable) polyhedral embeddings. This result supports a conjecture of Grünbaum that no snark admits an orientable polyhedral embedding. This conjecture is verified for all snarks having up to 30 vertices using computer. On the other hand, for every nonorie...
متن کاملAll toroidal embeddings of polyhedral graphs in 3-space are chiralw
The interplay between structural chemistry, graph theory and knot theory is a rich area for chemists and mathematicians alike. The founder of topology, Johann Listing, noted the possibility of chiral knots in 1847; a year later Pasteur published his landmark paper on the optical activity of ammonium tartrate crystals. Indeed, knot theory began following early studies on molecular isomerism. Mor...
متن کاملExistence of Polyhedral Embeddings of Graphs
It is proved that the decision problem about the existence of an embedding of face-width 3 of a given graph is NP-complete. A similar result is proved for some related decision problems. This solves a problem raised by Neil Robertson.
متن کاملMinimum Tenacity of Toroidal graphs
The tenacity of a graph G, T(G), is dened by T(G) = min{[|S|+τ(G-S)]/[ω(G-S)]}, where the minimum is taken over all vertex cutsets S of G. We dene τ(G - S) to be the number of the vertices in the largest component of the graph G - S, and ω(G - S) be the number of components of G - S.In this paper a lower bound for the tenacity T(G) of a graph with genus γ(G) is obtained using the graph's connec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Knot Theory and Its Ramifications
سال: 2017
ISSN: 0218-2165,1793-6527
DOI: 10.1142/s021821651750050x